A More Complete TLA
نویسنده
چکیده
This paper defines a generalization of Lamport’s Temporal Logic of Actions. We prove that our logic is stuttering-invariant and give an axiomatization of its propositional fragment. We also show that standard TLA is as expressive as our extension once quantification over flexible propositions is added.
منابع مشابه
A TLA+ Proof System
We describe an extension to the TLA specification language with constructs for writing proofs and a proof environment, called the Proof Manager (PM), to checks those proofs. The language and the PM support the incremental development and checking of hierarchically structured proofs. The PM translates a proof into a set of independent proof obligations and calls upon a collection of back-end pro...
متن کاملA TLA Solution to the RPC-Memory Specification Problem
We present a complete solution to the Broy Lamport speci cation problem Our speci cations are written in TLA a formal lan guage based on TLA We give the high levels of structured proofs and sketch the lower levels which will appear in full elsewhere
متن کاملEvaluation of the impact of a total automation system in a large core laboratory on turnaround time.
BACKGROUND Growing financial and workload pressures on laboratories coupled with user demands for faster turnaround time (TAT) has steered the implementation of total laboratory automation (TLA). The current study evaluates the impact of a complex TLA on core laboratory efficiency through the analysis of the In-lab to Report TAT (IR-TAT) for five representative tests based on the different requ...
متن کاملCache Coherence Verification with TLA+
We used the specification language TLA+ to analyze the correctness of two cache-coherence protocols for shared-memory multiprocessors based on two generations (EV6 and EV7) of the Alpha processor. A memory model defines the relationship between the values written by one processor and the values read by another, and a cache-coherence protocol manipulates the caches to preserve this relationship....
متن کاملTLA in Pictures
Predicate-action diagrams, which are similar to standard state-transition diagrams, are precisely defined as formulas of TLA (the Temporal Logic of Actions). We explain how these diagrams can be used to describe aspects of a specification—and those descriptions then proved correct— even when the complete specification cannot be written as a diagram. We also use the diagrams to illustrate proofs...
متن کامل